key hashing


key hashing
хэширование ключа (преобразование исходного ключа в более короткий, на котором и производится шифрование)

English-Russian cryptological dictionary . 2014.

Смотреть что такое "key hashing" в других словарях:

  • Key-to-Address Transform Techniques — In der Informatik bezeichnet man eine spezielle Indexstruktur als Hashtabelle (englisch hash table oder hash map) bzw. Streuwerttabelle. Hashtabellen eignen sich vor allem dazu, Datenelemente in einer großen Datenmenge aufzufinden. Hashtabellen… …   Deutsch Wikipedia

  • Hashing — Eine Hashfunktion oder Streuwertfunktion ist eine Funktion bzw. Abbildung, die zu einer Eingabe aus einer üblicherweise großen Quellmenge eine Ausgabe, den Hashcode, erzeugt, meist aus einer kleineren Zielmenge. Die Hashwerte beziehungsweise… …   Deutsch Wikipedia

  • hashing — /hash ing/, n. 1. Radio. interference of signals between two stations on the same or adjacent frequencies. 2. Computers. a technique for locating data in a file by applying a transformation, usually arithmetic, to a key. [HASH1 + ING1] * * * …   Universalium

  • hashing — /hash ing/, n. 1. Radio. interference of signals between two stations on the same or adjacent frequencies. 2. Computers. a technique for locating data in a file by applying a transformation, usually arithmetic, to a key. [HASH1 + ING1] * * *… …   Useful english dictionary

  • Brent-Hashing — (auch Doppel Hashing mit Brents Algorithmus) ist ein Berechnungsverfahren für eine Hashfunktion, das von dem australischen Mathematiker Richard P. Brent entwickelt und 1973 publiziert wurde.[1] Brent Hashing nutzt ausschließlich den Platz in der… …   Deutsch Wikipedia

  • Cuckoo hashing — example. The arrows show the alternative location of each key. A new item would be inserted in the location of A by moving A to its alternative location, currently occupied by B, and moving B to its alternative location which is currently vacant …   Wikipedia

  • Coalesced hashing — example. For purposes of this example, collision buckets are allocated in increasing order, starting with bucket 0. Coalesced hashing, also called coalesced chaining, is a strategy of collision resolution in a hash table that forms a hybrid of… …   Wikipedia

  • Consistent hashing — is a special kind of hashing. In contrast, in most traditional hash tables, a change in the number of array slots causes nearly all keys to be remapped. By using consistent hashing, only K / n keys need to be remapped on average, where K is the… …   Wikipedia

  • Double hashing — is a computer programming technique used in hash tables to resolve hash collisions, cases when two different values to be searched for produce the same hash key. It is a popular collision resolution technique in open addressed hash tables. Like… …   Wikipedia

  • 2-choice hashing — 2 choice hashing, also known as 2 choice chaining, is a variant of a hash table in which keys are added by hashing with two hash functions. The key is put in the array position with the fewer (colliding) keys. Some collision resolution scheme is… …   Wikipedia

  • Temporal Key Integrity Protocol — or TKIP is a security protocol used in the IEEE 802.11 wireless networks. Background TKIP (pronounced tee kip ) was designed by the IEEE 802.11i task group and the Wi Fi Alliance as a solution to replace WEP without requiring the replacement of… …   Wikipedia

Книги



Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.